ENPP: Extended Non-preemptive PP-aware Scheduling for Real-time Cloud Services

An Efficient Non-Preemptive Real-Time Scheduling

Traditional real-time systems are designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time systems, particularly for soft real-time multimedia applications. In this paper we propose a new algorithm that uses multiple scheduling strateg...

Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling

A non-preemptive scheduling algorithm for soft real-time systems

1 Please direct all correspondence to Krishna Kavi, Department of Computer Science and Engineering, The University of North Texas, P.O. Box 311366, Denton, Texas 76203, [email protected] Abstract Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring no...

Non-Preemptive Real Time Scheduling using Checkpointing Algorithm for Cloud Computing

This paper focuses on providing a solution for online real time services using non-preemptive scheduling algorithm in order to minimize the execution time of the migrated tasks. Earlier, a non-preemptive scheduling with task migration algorithm is used to minimize the penalty. Whenever a task misses its deadline, it will migrate the task to another virtual machine and starts its execution from ...

A Few Results on Non-Preemptive Real Time Scheduling

In this paper, we investigate the non-preemptive scheduling problem as it arises in single processor systems. We focus on non-idling scheduling, the idling scheduling is briefly introduced in the lasts section. We extend some previously published results concerning preemptive and non-preemptive scheduling over a single processor. The main issue that we study in this article is the applicability...